Atomic Routing Games on Maximum Congestion
نویسندگان
چکیده
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is the global maximum congestion over all edges in the network. We show that the price of stability is 1. The price of anarchy, PoA, is determined by topological properties of the network. In particular, PoA = O(`+ log n), where ` is the length of the longest path in the player strategy sets, and n is the size of the network. Further, κ−1 ≤ PoA ≤ c(κ2+ log2 n), where κ is the length of the longest cycle in the network, and c is a constant. © 2009 Elsevier B.V. All rights reserved.
منابع مشابه
Efficient graph topologies in network routing games
A topology is efficient for network games if, for any game over it, every Nash equilibrium is socially optimal. It is well known that many topologies are not efficient for network games. We characterize efficient topologies in network games with a finite set of players, each wishing to transmit an atomic unit of unsplittable flow. We distinguish between two classes of atomic network routing gam...
متن کاملEfficiency of Equilibria in Uniform Matroid Congestion Games
Network routing games, and more generally congestion games play a central role in algorithmic game theory, comparable to the role of the traveling salesman problem in combinatorial optimization. It is known that the price of anarchy is independent of the network topology for non-atomic congestion games. In other words, it is independent of the structure of the strategy spaces of the players, an...
متن کاملAtomic Selfish Routing in Networks: A Survey
In this survey we present some recent advances in the literature of atomic (mainly network) congestion games. The algorithmic questions that we are interested in have to do with the existence of pure Nash equilibria, the efficiency of their construction when they exist, as well as the gap of the best/worst (mixed in general) Nash equilibria from the social optima in such games, typically called...
متن کاملQuality of routing congestion games in wireless sensor networks
We consider congestion games in wireless sensor networks that offer quantitatively distinct classes of routing paths. Each routing class is characterized by a service cost. Within a routing class, the maximum link congestion is also an important metric for measuring the quality of the paths. Here, we study routing games where each player i selfishly selects a path with a respective routing clas...
متن کاملLoad Balancing Congestion Games and their Asymptotic Behavior
A central question in routing games has been to establish conditions for the uniqueness of the equilibrium, either in terms of network topology or in terms of costs. This question is well understood in two classes of routing games. The first is the non-atomic routing introduced by Wardrop on 1952 in the context of road traffic in which each player (car) is infinitesimally small; a single car ha...
متن کامل